翻訳と辞書 |
Circle packing in an isosceles right triangle : ウィキペディア英語版 | Circle packing in an isosceles right triangle Circle packing in a right isosceles triangle is a packing problem where the objective is to pack ''n'' unit circles into the smallest possible isosceles right triangle. Minimum solutions (lengths shown are length of leg) are shown in the table below. Solutions to the equivalent problem of maximizing the minimum distance between ''n'' points in an isosceles right triangle, are known to be optimal for ''n''< 8. In 2011 a heuristic algorithm found 18 improvements on previously known optima, the smallest of which was for ''n''=13. ==References== 〔
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Circle packing in an isosceles right triangle」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|